Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification

Identifieur interne : 000A28 ( Main/Exploration ); précédent : 000A27; suivant : 000A29

A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification

Auteurs : Klaus Schöffmann [Autriche] ; Mathias Lux [Autriche] ; Laszlo Böszörmenyi [Autriche]

Source :

RBID : ISTEX:DF2D5B5CBFE9E6A68D2DFDB788CC98EE66869C9C

Abstract

Abstract: Commercial blocks provide no extra value for video indexing, retrieval, archiving, or summarization of TV broadcasts. Therefore, automatic detection of commercial blocks is an important topic in the domain of multimedia information systems. We present a commercial detection approach which is based on logo detection performed in the compressed domain. The novelty of our approach is that by taking advantage of advanced features of the H.264/AVC coding, it is both significantly faster and more exact than existing approaches working directly on compressed data. Our approach enables removal of commercials in a fraction of real-time while achieving an average recall of 97.33% with an average precision of 99.31%. Moreover, due to its run-time performance, our approach can also be employed on low performance devices, for instance DVB recorders.

Url:
DOI: 10.1007/978-3-540-92892-8_13


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification</title>
<author>
<name sortKey="Schoffmann, Klaus" sort="Schoffmann, Klaus" uniqKey="Schoffmann K" first="Klaus" last="Schöffmann">Klaus Schöffmann</name>
</author>
<author>
<name sortKey="Lux, Mathias" sort="Lux, Mathias" uniqKey="Lux M" first="Mathias" last="Lux">Mathias Lux</name>
</author>
<author>
<name sortKey="Boszormenyi, Laszlo" sort="Boszormenyi, Laszlo" uniqKey="Boszormenyi L" first="Laszlo" last="Böszörmenyi">Laszlo Böszörmenyi</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:DF2D5B5CBFE9E6A68D2DFDB788CC98EE66869C9C</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-540-92892-8_13</idno>
<idno type="url">https://api.istex.fr/document/DF2D5B5CBFE9E6A68D2DFDB788CC98EE66869C9C/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000517</idno>
<idno type="wicri:Area/Istex/Curation">000510</idno>
<idno type="wicri:Area/Istex/Checkpoint">000550</idno>
<idno type="wicri:doubleKey">0302-9743:2009:Schoffmann K:a:novel:approach</idno>
<idno type="wicri:Area/Main/Merge">000A36</idno>
<idno type="wicri:Area/Main/Curation">000A28</idno>
<idno type="wicri:Area/Main/Exploration">000A28</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification</title>
<author>
<name sortKey="Schoffmann, Klaus" sort="Schoffmann, Klaus" uniqKey="Schoffmann K" first="Klaus" last="Schöffmann">Klaus Schöffmann</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Autriche</country>
<wicri:regionArea>Institute of Information Technology (ITEC), University of Klagenfurt, Universitätsstr. 65-67, 9020, Klagenfurt</wicri:regionArea>
<wicri:noRegion>Klagenfurt</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Autriche</country>
</affiliation>
</author>
<author>
<name sortKey="Lux, Mathias" sort="Lux, Mathias" uniqKey="Lux M" first="Mathias" last="Lux">Mathias Lux</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Autriche</country>
<wicri:regionArea>Institute of Information Technology (ITEC), University of Klagenfurt, Universitätsstr. 65-67, 9020, Klagenfurt</wicri:regionArea>
<wicri:noRegion>Klagenfurt</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Autriche</country>
</affiliation>
</author>
<author>
<name sortKey="Boszormenyi, Laszlo" sort="Boszormenyi, Laszlo" uniqKey="Boszormenyi L" first="Laszlo" last="Böszörmenyi">Laszlo Böszörmenyi</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Autriche</country>
<wicri:regionArea>Institute of Information Technology (ITEC), University of Klagenfurt, Universitätsstr. 65-67, 9020, Klagenfurt</wicri:regionArea>
<wicri:noRegion>Klagenfurt</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Autriche</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2009</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">DF2D5B5CBFE9E6A68D2DFDB788CC98EE66869C9C</idno>
<idno type="DOI">10.1007/978-3-540-92892-8_13</idno>
<idno type="ChapterID">13</idno>
<idno type="ChapterID">Chap13</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: Commercial blocks provide no extra value for video indexing, retrieval, archiving, or summarization of TV broadcasts. Therefore, automatic detection of commercial blocks is an important topic in the domain of multimedia information systems. We present a commercial detection approach which is based on logo detection performed in the compressed domain. The novelty of our approach is that by taking advantage of advanced features of the H.264/AVC coding, it is both significantly faster and more exact than existing approaches working directly on compressed data. Our approach enables removal of commercials in a fraction of real-time while achieving an average recall of 97.33% with an average precision of 99.31%. Moreover, due to its run-time performance, our approach can also be employed on low performance devices, for instance DVB recorders.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Autriche</li>
</country>
</list>
<tree>
<country name="Autriche">
<noRegion>
<name sortKey="Schoffmann, Klaus" sort="Schoffmann, Klaus" uniqKey="Schoffmann K" first="Klaus" last="Schöffmann">Klaus Schöffmann</name>
</noRegion>
<name sortKey="Boszormenyi, Laszlo" sort="Boszormenyi, Laszlo" uniqKey="Boszormenyi L" first="Laszlo" last="Böszörmenyi">Laszlo Böszörmenyi</name>
<name sortKey="Boszormenyi, Laszlo" sort="Boszormenyi, Laszlo" uniqKey="Boszormenyi L" first="Laszlo" last="Böszörmenyi">Laszlo Böszörmenyi</name>
<name sortKey="Lux, Mathias" sort="Lux, Mathias" uniqKey="Lux M" first="Mathias" last="Lux">Mathias Lux</name>
<name sortKey="Lux, Mathias" sort="Lux, Mathias" uniqKey="Lux M" first="Mathias" last="Lux">Mathias Lux</name>
<name sortKey="Schoffmann, Klaus" sort="Schoffmann, Klaus" uniqKey="Schoffmann K" first="Klaus" last="Schöffmann">Klaus Schöffmann</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A28 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000A28 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:DF2D5B5CBFE9E6A68D2DFDB788CC98EE66869C9C
   |texte=   A Novel Approach for Fast and Accurate Commercial Detection in H.264/AVC Bit Streams Based on Logo Identification
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024